首页> 外文OA文献 >Coalitional Graph Games for Popular Content Distribution in Cognitive Radio VANETs
【2h】

Coalitional Graph Games for Popular Content Distribution in Cognitive Radio VANETs

机译:认知策略中流行内容分布的联盟图游戏   无线电VaNET

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Popular content distribution is one of the key services provided by vehicularad hoc networks (VANETs), in which a popular file is broadcasted by roadsideunits (RSUs) to the on-board units (OBUs) driving through a particular area.Due to fast speed and deep fading, some file packets might be lost during thevehicle-to-roadside broadcasting stage. In this paper, we propose apeer-to-peer (P2P) approach to allow the OBUs to exchange data and complementthe missing packets. Specifically, we introduce a coalitional graph game tomodel the cooperation among OBUs and propose a coalition formation algorithm toimplement the P2P approach. Moreover, cognitive radio is utilized forvehicle-to-vehicle transmissions so that the P2P approach does not requireadditional bandwidth. Simulation results show that the proposed approachperforms better in various conditions, relative to the non-cooperativeapproach, in which the OBUs share no information and simply response to anydata request from other OBUs.
机译:流行的内容分发是车辆专用网络(VANET)提供的关键服务之一,其中流行的文件由路边单位(RSU)广播到行进特定区域的车载单位(OBU)。深度衰减时,某些文件包可能在车到路边的广播阶段丢失。在本文中,我们提出了一种点对点(P2P)方法,以允许OBU交换数据并补充丢失的数据包。具体来说,我们引入了一个联盟图博弈来建模OBU之间的协作,并提出了一种联盟形成算法来实现P2P方法。此外,认知无线电被用于车辆到车辆的传输,使得P2P方法不需要附加带宽。仿真结果表明,相对于非合作式方法,OBU不共享信息,仅对其他OBU的任何数据请求做出响应,该方法在各种条件下均具有更好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号